A Matching Process Modulo a Theory of Categorical Products
نویسنده
چکیده
We present a matching algorithm modulo axioms of categorical products. This infinitary matching returns what we call selector-solved forms in which sets of equations have been simplified as much as possible. Although the selectorsolved form is weaker than the fully solved form, it is sufficient for application to program transformation.
منابع مشابه
A History of Selected Topics in Categorical Algebra I: From Galois Theory to Abstract Commutators and Internal Groupoids
This paper is a chronological survey, with no proofs, of a direction in categorical algebra, which is based on categorical Galois theory and involves generalized central extensions, commutators, and internal groupoids in Barr exact Mal’tsev and more general categories. Galois theory proposes a notion of central extension, and motivates the study of internal groupoids, which is then used as an a...
متن کاملDeriving Bisimulation Congruences: A 2-categorical Approach
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for process calculi where terms are viewed modulo structural congruence. We develop their basic properties and show that bisimulation on the LTS derived via GRPOs is a congruence, provided that sufficiently many GRPOs exist...
متن کاملA Local Graph-rewriting System for Deciding Equality in Sum-product Theories
The point-free style of programming [1] has been defended as a good choice for reasoning about functional programs. However, when one actually tries to construct a decision procedure for the associated equational theory, one faces problems, even when small fragments of the theory are considered. In this paper we outline how a graph-based decision procedure can be given for the functional calcul...
متن کاملA Local Graph - rewriting System for Deciding Equality in Sum - product
The point-free style of programming [1] has been defended as a good choice for reasoning about functional programs. However, when one actually tries to construct a decision procedure for the associated equational theory, one faces problems, even when small fragments of the theory are considered. In this paper we outline how a graph-based decision procedure can be given for the functional calcul...
متن کاملConvenient Category of Processes and Simulations 1: Modulo Strong Bisimilarity
Deep categorical analyses of various aspects of concurrency have been developed, but a uniform categorical treatment of the very rst concepts seems to be hindered by the fact that the existing representations of processes as bisimilarity classes do not provide a suucient account of computational morphisms. In the present paper, we describe a category of processes modulo strong bisimulations, wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990